M/M/1 retrial queue with working vacations and negative customer arrivals
نویسندگان
چکیده
The M/M/1 retrial queue with working vacations and negative customers is introduced. The arrival processes of positive customers and negative customers are Poisson. Upon the arrival of a positive customer, if the server is busy the customer would enter an orbit of infinite size and the orbital customers send their requests for service with a constant retrial rate. The single server takes an exponential working vacation once customers being served depart from the system and no customers are in the orbit. Arriving negative customers kill a batch of the positive customers waiting in the orbit randomly. Efficient methodology to compute the stationary distribution for this new queue is developed and presented.
منابع مشابه
Steady State Analysis of Batch Arrival M/G/1 Retrial Queuing Model with State Dependent Admission, Modified Vacation and Feedback
Abstract. A batch arrival retrial queue with general retrial times, state dependent admission, modified vacation policy and feed back is analysed in this paper. Arrivals are controlled according to the state of the server. If the orbit is empty, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from the vacation. At the service com...
متن کاملAn M/g/1 Retrial Queue with Unreliable Server and Vacations
In this paper, we consider retrial queueing systems with batch arrivals in which the server is subject to controllable interruptions (called vacations) and random interruptions (breakdowns). No specific assumption is taken regarding probability distributions of parametric random variables. The purpose of this work is to show effect of above mentioned parameters (in particular retrial and breakd...
متن کاملAnalysis of Single Server Retrial Queue with Batch Arrivals, Two Phases of Heterogeneous Service and Multiple Vacations with N–Policy
⎯We consider a single server retrial queue with batch arrivals, two phases of heterogeneous service and multiple vacations with Npolicy. The primary arrivals find the server busy or doing secondary job (vacation) will join orbit (group of repeated calls). If the number of repeated calls in orbit is less than N, the server does the secondary job repeatedly until the retrial group size reaches N....
متن کاملBat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue
In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...
متن کاملAnalysis of a preemptive priority retrial queue with negative customers, starting failure and at most J vacations
An analysis of single server preemptive priority retrial queue with at most J vacations where two types of customers called (priority customers and ordinary customers) are considered in this paper. The priority customers do not have queue and they have higher priority to receive their services over ordinary customers. If negative customer is arriving during the service time of any positive cust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAIP
دوره 6 شماره
صفحات -
تاریخ انتشار 2014